Geometric spanners with small chromatic number
نویسندگان
چکیده
منابع مشابه
Geometric Spanners with Small Chromatic Number
Given an integer k ≥ 2, we consider the problem of computing the smallest real number t(k) such that for each set P of points in the plane, there exists a t(k)-spanner for P that has chromatic number at most k. We prove that t(2) = 3, t(3) = 2, t(4) = √ 2, and give upper and lower bounds on t(k) for k > 4. We also show that for any > 0, there exists a (1 + )t(k)-spanner for P that has O(|P |) e...
متن کاملGraphs with Small Generalized Chromatic Number
Let G = (V; E) denote a nite simple undirected connected graph of order n = jV j and diameter D. For any integer k 2 1; D], a proper k-colouring of G is a labelling of the vertices V such that no two distinct vertices at distance k or less have the same label. We let k (G), the k-chromatic number of G, denote the least number of labels required to achieve a proper k-colouring of G. In this pape...
متن کاملGeometric Spanners
Geometric Spanners Name: Joachim Gudmundsson, Giri Narasimhan, Michiel Smid Affil./Addr. 1: School of Information Technologies, The University of Sydney, NSW, Australia Affil./Addr. 2: School of Computing & Information Sciences Florida International University, FL, USA Affil./Addr. 3: School of Computer Science Carleton University, ON, Canada
متن کاملOn The Chromatic Number of Geometric Hypergraphs
A finite family R of simple Jordan regions in the plane defines a hypergraph H = H(R) where the vertex set of H is R and the hyperedges are all subsets S ⊂ R for which there is a point p such that S = {r ∈ R|p ∈ r}. The chromatic number of H(R) is the minimum number of colors needed to color the members of R such that no hyperedge is monochromatic. In this paper we initiate the study of the chr...
متن کاملOn the Chromatic Number of Geometric Graphs
Let S be a finite or infinite set in the Euclidean space 3E . We definte the graph G(S) on the vertex-set S by joining x,y c S iff p(x,y) / = their distance / is 1 . In this paper we investigate various chromatic properties and the dimension of h such graphs . Thus for example X e (IE ) will be defined as the maximum t such that if G n = G(S) S c Eh then one can omit o(n 2 ) edges so that the g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2009
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2008.04.003